Adaptive basis sets for practical quantum computing
نویسندگان
چکیده
Electronic structure calculations on small systems such as H2, H2O, LiH, and BeH2 with chemical accuracy are still a challenge for the current generation of noisy intermediate-scale quantum (NISQ) devices. One reasons is that due to device limitations, only minimal basis sets commonly applied in calculations, which allows one keep number qubits employed at minimum. However, use leads very large errors computed molecular energies well potential energy surface shapes. way increase electronic through development better suited computing. In this work, we show adaptive sets, exponents contraction coefficients depend structure, provides an easy dramatically improve without need set size thus utilized circuits. As proof principle, optimize computing H2 molecule, HH distance, apply it IBM-Q The reaches double-zeta allowing perform quality devices utilize twice many simulations. This approach can be extended other larger straightforward manner.
منابع مشابه
Practical adaptive quantum tomography
We introduce a fast and accurate heuristic for adaptive tomography that addressesmany of the limitations of priormethods. Previous approaches were either too computationally intensive or tailored to handle special cases such as single qubits or pure states. By contrast, our approach combines the efficiency of online optimizationwith generally applicable andwell-motivated data-processing techniq...
متن کاملSymmetrical overlap transformations of function basis sets: the LCAO MO and quantum similarity practical cases
Quantum chemical computational procedures, like LCAOMO theory and quantum similarity, use non orthogonal function basis sets, which define finite dimensional subspaces of a Hilbert space. Based on the original overlap metric matrices, generated by the chosen finite non orthogonal basis sets, there are several symmetrical overlap and basis set transformations possible. This study tries to find o...
متن کامل1 History and Basis of Quantum Computing
Idea and concept of quantum computing was introduced way backs in 1970s and 1980s, by Richard Feynmann, David Deutsch and Paul Benioff. First breakthrough of the concept was reported in 1994 in Peter Shor’s factoring algorithm, followed by Lov Grover, searching algorithm in 1996. Isaac L. Chuang, developed the world’s first 2-qubit, 3-qubit, 5-qubit and 7-qubit quantum computer in 1996–2000. In...
متن کاملParamagnetic Materials and Practical Algorithmic Cooling for Nmr Quantum Computing *
Algorithmic Cooling is a method that uses novel data compression techniques and simple quantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A reversible entropy compression of the computation quantum-bits (qubits) of the system and an irreversible heat transfer from the system to the environment through ...
متن کاملPhase space optimization of quantum representations: Direct-product basis sets
The quantitative phase space similarities between the uniformly mixed ensembles of eigenstates, and the quasiclassical Thomas–Fermi distribution, are exploited in order to generate a nearly optimal basis representation for an arbitrary quantum system. An exact quantum optimization functional is provided, and the minimum of the corresponding quasiclassical functional is proposed as an excellent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Chemistry
سال: 2023
ISSN: ['1097-461X', '0020-7608']
DOI: https://doi.org/10.1002/qua.27123